3. Symbol: 'r'
...
3. Symbol: 'r'
Current code tree
Successor
No. Pred. Cont. "0" "1" Weight
7. 9 NYA - - 0
8. 9 "b" - - 1
9. 11 - 7 8 1
10. 11 "a" - - 1
11. Root 9 10 2
No leaf node is available for the symbol 'r'; new nodes are required for 'r' and NYA:
Successor
No. Pred. Cont. "0" "1" Weight
5. 7 NYA - - 0
6. 7 "r" - - 1
7. 9 - 5 6 0
8. 9 "b" - - 1
9. 11 - 7 8 1
10. 11 "a" - - 1
11. Root 9 10 2
The weight of the current node has to be incremented:
Successor
No. Pred. Cont. "0" "1" Weight
5. 7 NYA - - 0
6. 7 "r" - - 1
7. 9 - 5 6 1
8. 9 "b" - - 1
9. 11 - 7 8 1
10. 11 "a" - - 1
11. Root 9 10 2
Continue with the predecessor of the current node:
Successor
No. Pred. Cont. "0" "1" Weight
5. 7 NYA - - 0
6. 7 "r" - - 1
7. 9 - 5 6 1
8. 9 "b" - - 1
9. 11 - 7 8 1
10. 11 "a" - - 1
11. Root 9 10 2
There is a higher-order node (10) in the current block and it is not predecessor of the current node. The current node (9) and the most significant node (10) has to be exchanged with each other:
Successor
No. Pred. Cont. "0" "1" Weight
5. 7 NYA - - 0
6. 7 "r" - - 1
7. 10 - 5 6 1
8. 10 "b" - - 1
9. 11 "a" - - 1
10. 11 - 7 8 1
11. Root 9 10 2
The weight of the current node has to be incremented:
Successor
No. Pred. Cont. "0" "1" Weight
5. 7 NYA - - 0
6. 7 "r" - - 1
7. 10 - 5 6 1
8. 10 "b" - - 1
9. 11 "a" - - 1
10. 11 - 7 8 2
11. Root 9 10 2
Continue with the predecessor of the current node:
Successor
No. Pred. Cont. "0" "1" Weight
5. 7 NYA - - 0
6. 7 "r" - - 1
7. 10 - 5 6 1
8. 10 "b" - - 1
9. 11 "a" - - 1
10. 11 - 7 8 2
11. Root 9 10 2
The current node is already the most significant node of the block. Therefore its weight may be incremented without exchange:
Successor
No. Pred. Cont. "0" "1" Weight
5. 7 NYA - - 0
6. 7 "r" - - 1
7. 10 - 5 6 1
8. 10 "b" - - 1
9. 11 "a" - - 1
10. 11 - 7 8 2
11. Root 9 10 3
The root node is reached, the update procedure will be terminated.
