Slog 6

week7's topic is about binary Tree. Binary is a little bit different from normal tree. Firstly, instead of multiple of children nodes, binary tree only has two children nodes. To be more precise, it only has left children node and right children node for each nodes. Moreover, binary search tree is more useful than normal binary tree. In binary search tree, each left children is smaller than their parent node and right hand side children is greater than their parent node. Therefore, it makes easier for computer scientists to manage their data, and it also makes sorting faster. In conclusion, binary Tree is a very useful abstract datatype.