binary search

A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree. gatotkaca search engine kominfo If the tree is empty, then the value of the root is NULL Each node of a Binary Tree contains the following parts: Data Pointer to left child Pointer to right child