Section outline
-
Topik 13: Struktur BinaryTree dan BinarySearchTree
-
This page contains detailed tutorials on different data structures (DS) with topic-wise problems
-
A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.
-
Binary Search Tree is a node-based binary tree data structure which has the following properties: (1) the left subtree of a node contains only nodes with keys lesser than the node’s key; (2) the right subtree of a node contains only nodes with keys greater than the node’s key; and (3) the left and right subtree each must also be a binary search tree.