Given a Binary Tree, extract all leaves of it in a Doubly Linked List (DLL). Note that the DLL need to be created in-place. Assume that the node structure of DLL and Binary Tree is same, only the meaning of left and right pointers are different. In DLL, left means previous pointer and right me...
In fact one of the performance optimizations is to add a comment that starts at the end of your tag... and ends at the start of the next tag (on the next line)
Uh... well, the same person who thought programming tags was a good idea?
<!--- This view-only example shows the use of StructFind. --->
<p>This file is identical to addemployee.cfm, which is called by StructNew,
StructClear, and StructDelete. It adds employees. Employee information
is passed through the employee structure (EMPINFO attribute). In UNIX,
you must also add the Emp_ID.
<!--- <cfswitch expression = "#ThisTag.ExecutionMode#">
<cfcase value = "start">
<cfif StructIsEmpty(attributes.EMPINFO)>
<cfoutput>Error. No employee data was passed.</cfoutput>
> Short strings, such as 1a and 2P, can produce unexpected results. ColdFusion can interpret a single "a" as AM and a single "P" as PM. This can cause ColdFusion to interpret strings as date-time values in cases where this was not intended.
Given a binary tree, a complete path is defined as a path from root to a leaf. The sum of all nodes on that path is defined as the sum of that path. Given a number K, you have to remove (prune the tree) all nodes which don’t lie in any path with sum>=k.
Note: A node can be part of multipl...
Start a transaction... alter Entity A, save entity A
do a rollback
start a transaction, Alter entity B, save entity B
commit
Both Entity A and Entity B are now saved.
Of course, if you dump a large struct for debugging purposes and it contains too much stuff then you'll get a error message that it timed out on cfdump
complete with cryptic stacktrace
the community in coldfusion doesn't help either
they're amazed by the fact that it works on JAVA!!!
If linkedlist is 1->2->3->4 then the output should be 1->3, if the linkedlist is 1->2->3->4->5, then the output should be 1->2->5.
The question is attributed to GeeksForGeeks.Looking for code-review, best practices and optimizations.
public class DeleteAlternate<T> {
private Node<T> fi...
I was inspired by Me How's question to see how far I could push an imitation of .Net's Enumerable Class.
The new functions can obviously handle Collections, but can also handle any collection-type object whose items have a default value. If a collectionObject's items don't have a default value,...
If you install this hook in your repository and push branch foo-automerge to this repository, this hook will merge this branch into working copy if:
currently checked out branch is named foo.
working directory is clean
merge would be fast-forward
Reasons why I need it are outlined on my qu...
Given a Binary Tree, extract all leaves of it in a Doubly Linked List (DLL). Note that the DLL need to be created in-place. Assume that the node structure of DLL and Binary Tree is same, only the meaning of left and right pointers are different. In DLL, left means previous pointer and right me...
I was inspired by Me How's question to see how far I could push an imitation of .Net's Enumerable Class.
The new functions can obviously handle Collections, but can also handle any collection-type object whose items have a default value. If a collectionObject's items don't have a default value,...
If you install this hook in your repository and push branch foo-automerge to this repository, this hook will merge this branch into working copy if:
currently checked out branch is named foo.
working directory is clean
merge would be fast-forward
Reasons why I need it are outlined on my qu...
