Introduction to Binary Tree

Mengenai tree concep adanya bebreapa koleksi

Dan ini tambahan info untuk koding

•          Node at the top is called as root.

•          A line connecting the parent to the child is edge.

•          Nodes that do not have children are called leaf.

•          Nodes that have the same parent are called sibling.

•          Degree of node is the total sub tree of the node.

•          Height/Depth is the maximum degree of nodes in a tree.

•          If there is a line that connects p to q, then p is called the ancestor of q, and q is a descendant of p.

Konsep dari binary tree

•          Binary tree is a rooted tree data structure in which each node has at most two children.

•          Those two children usually distinguished as left child and right child.

•          Node which doesn’t have any child is called leaf.

Jika ada perfect binary tree yg berarti 1 parent = 2 child dan berurutan. Bisa juga dipanggil Complete BT.

Implementasinya dalam Binary Tree

struct node {

                int data;

                struct node *left;

                struct node *right;

                struct node *parent;

};

struct node *root = NULL;

Dalam perhitungan

Prefix : Hitung dari tengah ke kiri

Post : Hitung dari bawah PALING kiri

Ada juga mengenai

PERFECT binary tree is a binary tree in which every level are at the same depth.

COMPLETE binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. A perfect binary tree is a complete binary tree.

SKEWED binary tree is a binary tree in which each node has at most one child.

BALANCED binary tree is a binary tree in which no leaf is much farther away from the root than any other leaf (different balancing scheme allows different definitions of “much farther”).